Lowest-density MDS array codes for reliable Smart Meter networks

نویسندگان

  • Magnus Sandell
  • Filippo Tosato
چکیده

In this paper we introduce a lowest density MDS array code which is applied to a Smart Meter network to introduce reliability. By treating the network as distributed storage with multiple sources, information can be exchanged between the nodes in the network allowing each node to store parity symbols relating to data from other nodes. A lowest density MDS array code is then applied to make the network robust against outages, ensuring low overhead and data transfers. We show the minimum amount of overhead required to be able to recover from r node erasures in an n node network and explicitly design an optimal array code with lowest density. In contrast to existing codes, this one has no restrictions on the number of nodes or erasures it can correct. Furthermore we consider incomplete networks where all nodes are not connected to each other. This limits the exchange of data for purposes of redundancy and we derive conditions on the minimum node degree that allow lowest density MDS codes to exist. We also present an explicit code design for incomplete networks that is capable of correcting two node failures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

S-Code: Lowest Density MDS Array Codes for RAID-6

RAID, a storage architecture designed to exploit I/O parallelism and provide data reliability, has been deployed widely in computing systems as a storage building block. In large scale storage systems, in particular, RAID-6 is gradually replacing RAID-5 as the dominant form of disk arrays due to its capability of tolerating concurrent failures of any two disks. MDS (maximum distance separable) ...

متن کامل

C-Codes: Cyclic Lowest-Density MDS Array Codes Constructed Using Starters for RAID 6

The distance-3 cyclic lowest-density MDS array code (called the C-Code) is a good candidate for RAID 6 because of its optimal storage efficiency, optimal update complexity, optimal length, and cyclic symmetry. In this paper, the underlying connections between C-Codes (or quasi-C-Codes) and starters in group theory are revealed. It is shown that each C-Code (or quasi-C-Code) of length 2n can be ...

متن کامل

A New Framework for Increasing the Sustainability of Infrastructure Measurement of Smart Grid

Advanced Metering Infrastructure (AMI) is one of the most significant applications of the Smart Grid. It is used to measure, collect, and analyze data on power consumption.  In the AMI network, the smart meters traffics are aggregated in the intermediate aggregators and forwarded to the Meter Data Management System (MDMS). The infrastructure used in this network should be reliable, real-time an...

متن کامل

Shortening Array Codes and the Perfect -Factorization Conjecture

The existence of a perfect -factorization of the complete graph with nodes, namely, , for arbitrary even number , is a 40-year-old open problem in graph theory. So far, two infinite families of perfect -factorizations have been shown to exist, namely, the factorizations of and , where is an arbitrary prime number . It was shown in previous work that finding a perfect -factorization of is relate...

متن کامل

High-fidelity reliability simulation of XOR-based erasure codes

Erasure codes are the means by which storage systems are typically made reliable. Recent high profile studies of disk failure and sector failures indicate that ever more fault tolerant erasure codes are needed. Many traditional RAID approaches, parity-check array codes (e.g.,EVENODD, RDP, and X-code), and MDS codes offer two and three disk fault tolerant schemes. There are also many novel erasu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Trans. Emerging Telecommunications Technologies

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2015